{\omega}-Automata
نویسنده
چکیده
This paper gives a concise introduction into the basic theory of ω-automata (as of March 2014). The starting point are the different types of recurrence conditions, modes of operation (deterministic, nondeterministic, alternating automata), and directions (forward or backward automata). The main focus is on fundamental automata constructions, for instance, for boolean operations, determinization, disambiguation, and removing alternation. It also covers some algebraic aspects such as congruences for ω-automata (and ω-languages), basic structure theory (loops), and applications in mathematical logic.—This paper may eventually become a chapter in a handbook of automata theory.
منابع مشابه
Applications of a group in general fuzzy automata
Let $tilde{F}=(Q,S,tilde{R},Z,omega,tilde{delta}, F_1,F_2)$ be a general fuzzy automaton and the set of its states be a group. The aim of this paper is the study of applications of a group in a general fuzzy automaton. For this purpose, we define the concepts of fuzzy normal kernel of a general fuzzy automaton, fuzzy kernel of a general fuzzy automaton, adjustable, multip...
متن کاملRelationship between Alternating omega-Automata and Symbolically Represented Nondeterministic omega-Automata
There is a well known relationship between alternating automata on finite words and symbolically represented nondeterministic automata on finite words. This relationship is of practical relevance because it allows to combine the advantages of alternating and symbolically represented nondeterministic automata on finite words. However, for infinite words the situation is unclear. Therefore, this ...
متن کاملSeminator: A Tool for Semi-Determinization of Omega-Automata
We present a tool that transforms nondeterministic ω-automata to semi-deterministic ω-automata. The tool Seminator accepts transition-based generalized Büchi automata (TGBA) as an input and produces automata with two kinds of semi-determinism. The implemented procedure performs degeneralization and semi-determinization simultaneously and employs several other optimizations. We experimentally ev...
متن کاملA decidable class of (nominal) omega-regular languages over an infinite alphabet
We define a class of languages of infinite words over infinite alphabets, and the corresponding automata. The automata used for recognition are a generalisation of deterministic Muller automata to the setting of nominal sets. Remarkably, the obtained languages are determined by their ultimately periodic fragments, as in the classical case. Closure under complement, union and intersection, and d...
متن کاملCounter-queue Automata with an Application to a Meaningful Extension of Omega-regular Languages
In this paper, we introduce a new class of automata over infinite words (counter-queue automata) and we prove the decidability of their emptiness problem. Then, we define an original extension of ωregular languages, called ωT -regular languages, that captures meaningful languages that neither belong to the class of ω-regular languages nor to other extensions of it proposed in the literature, an...
متن کاملCardinality and counting quantifiers on omega-automatic structures
We investigate structures that can be represented by omega-automata, so called omega-automatic structures, and prove that relations defined over such structures in first-order logic expanded by the first-order quantifiers ‘there exist at most א0 many’, ’there exist finitely many’ and ’there exist k modulo m many’ are omega-regular. The proof identifies certain algebraic properties of omega-semi...
متن کامل